Decomposing Pattern Matching Circuit

نویسندگان

  • Grzegorz Borowik
  • Tadeusz Luba
چکیده

This paper presents a new cost-efficient realization scheme of pattern matching circuits in FPGA structures with embedded memory blocks (EMB). The general idea behind the proposed method is to implement combinational circuits using a net of finite state machines (FSM) instead. The application of functional decomposition method reduces the utilization of resources by implementing FSMs using both EMBs and LUT-based programmable logic blocks available in contemporary FPGAs. Experimental results for the proposed method are also shown. A comparison with another dedicated method yields extremely encouraging results: with a comparable number of EMBs, the number of logic cells has been reduced by 95%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Model of Pattern - Matching Circuit Architectures Tech

There has been a significant volume of recent work on FPGA designs for pattern matching. Although various pattern-matching architectures have been presented, attempts to compare different designs have been inconclusive, or even misleading, due to the lack of a common evaluation framework. In this paper, we present an analytical model of FPGA pattern-matching architectures that quantitatively ex...

متن کامل

Graph matching and clustering using spectral partitions

Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suitable for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into nonov...

متن کامل

Pattern matching in a model of dendritic spines.

Pattern matching, the ability to recognize and maximally respond to an input pattern that is similar to a previously learned pattern, is an essential step in any learning process. To investigate the properties of pattern matching in biological neurons, and in particular the role of a calcium-dependent potassium conductance, a circuit model of a small area of dendritic membrane with a number of ...

متن کامل

Compressing and Indexing Stock Market Data

We show how to build a compressed index for the offline Order Preserving Pattern Matching problem. Our solution is based on the new approach of decomposing the sequence to be indexed into an order component, containing ordering information, and a δ component, containing information on the absolute values. The Order Preserving Matching problem is then transformed into an exact matching problem o...

متن کامل

Novel FPGA-Based Signature Matching for Deep Packet Inspection

Deep packet inspection forms the backbone of any Network Intrusion Detection (NID) system. It involves matching known malicious patterns against the incoming traffic payload. Pattern matching in software is prohibitively slow in comparison to current network speeds. Thus, only FPGA (Field-Programmable Gate Array) or ASIC (ApplicationSpecific Integrated Circuit) solutions could be efficient for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009